Depth-bounded computation
نویسندگان
چکیده
منابع مشابه
Depth-Bounded Communication Complexity for Distributed Computation
"!# $% !# &' )( * +& , -.-/ &0 21 , 3& , -3! 4) '5 ) 6 78 9 ;:< 3 ;:<,=! *> & 4)4) . % !? @$ @ ' A& , -.! B @1 , ? @4<&', -.!#, ' > 0C DE* F, ! -. G0 2 , H, 7 I; &' )( J K ,L-. 1 -. G + @-3, > 3, M MN, $%-3 2 , O 95 &B*? +78 9 ;:< O * % + 6: , !? @$ 0C P @$% Q *? 2 R * ,@ , A, MS& , -.-/ &0 2 , 3 ! * * , 4 T7# F&0 @! $% T ,U$% 'V? &' * J % -W!# $%MN, $%-A @ & C 6 !? @$ & 4X @$ Y:< K:E 4 4 MZ,>&...
متن کاملDepth-bounded Discrepancy Search
Many search trees are impractical ly large to explore exhaustively. Recently, techniques like l imi ted discrepancy search have been proposed for improving the chance of f inding a goal in a l imi ted amount of search. Depth-bounded discrepancy search offers such a hope. The motivat ion behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top o...
متن کاملDepth - bounded Discrepancy
Many search trees are impractically large to explore exhaustively. Recently, techniques like limited discrepancy search have been proposed for improving the chance of nding a goal in a limited amount of search. Depth-bounded discrepancy search ooers such a hope. The motivation behind depth-bounded discrepancy search is that branching heuristics are more likely to be wrong at the top of the tree...
متن کاملBounded Depth Data Trees
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By developing an appropriate automaton model, we show that under this assumption various formalisms, including a two variable first-order logic and a subset of XPath, have decidable emptiness problems.
متن کاملResource-Bounded Local Computation
This paper proposes a generic approximation method for solving the problem of inference under limited computational resources. The method is based on the concept of valuation algebras with its wide range of possible instantiations in many different domains. The goal is to construct convenient resource-bounded anytime algorithms, for which the available time to perform the local computations is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1970
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(70)80008-3